|
|
Statistical analysis of compound distributions
Konečný, Zdeněk ; Druckmüller, Miloslav (referee) ; Michálek, Jaroslav (advisor)
The probability distribution of a random variable created by summing a random number of the independent and identically distributed random variables is called a compound probability distribution. In this work is described a compound distribution as well as a calculation of its characteristics. Especially, the thesis is focused on studying a special case of compound distribution where each addend has the log-normal distribution and their number has the negative binomial distribution. Here are also described some approaches to estimate the parameters of LN and NB distribution. Further, the impact of these estimates on the final compound distribution is analyzed.
|
|
|
Discrete Channel Capacity
Butora, Jan ; Holub, Štěpán (advisor) ; Žemlička, Jan (referee)
Title: Discrete Channel Capacity Author: Jan Butora Department: Department of Algebra Supervisor: doc. Mgr. Štěpán Holub, Ph.D. et Ph.D., Department of Algebra Abstract: This Bachelor thesis introduces and examines C.E. Shannon's discrete channel capacity theory, which was first published in 1948 as one of the founding studies in the field of mathematical information theory. In the first place, possible way of information measurement is presented and communication systems are described. Additionally, emphasis is given to discrete noiseless channel and the theorem on calculating the capacity of such channels is examined and proven. Shannon's proof is examined in detail as it contains several non-trivial results in finite differences. Finally, calculation of channel capacity using the theorem is shown in practice. Keywords: difference equations, generating function, channel capacity
|
|
|
Enumeration of compositions with forbidden patterns
Dodova, Borjana ; Klazar, Martin (advisor) ; Jelínek, Vít (referee)
Enumeration of pattern avoiding compositions of numbers Abstract The aim of this work was to find some new results for 3-regular compositions, i.e., for those compositions which avoid the set of patterns {121, 212, 11}. Those compositions can be regarded as a generalization of Carlitz composition. Based on the generating function of compositions avoiding the set of patterns {121, 11} and {212, 11} we derive an upper bound for the coefficients of the power series of the generating function of 3-regular compositions. Using the theory of finite automata we derive its lower bound. We develop this result further by defining 3-block compositions. For the generating function of 3-regular compositions we prove a recursive ralation. Besides that we also compute the generating function of compositions avoiding the set of patterns {312, 321} whose parts are in the set [d]. In the last section we prove that the generating function of Carlitz compositions is transcendental.
|
|
|
Statistical analysis of compound distributions
Konečný, Zdeněk ; Druckmüller, Miloslav (referee) ; Michálek, Jaroslav (advisor)
The probability distribution of a random variable created by summing a random number of the independent and identically distributed random variables is called a compound probability distribution. In this work is described a compound distribution as well as a calculation of its characteristics. Especially, the thesis is focused on studying a special case of compound distribution where each addend has the log-normal distribution and their number has the negative binomial distribution. Here are also described some approaches to estimate the parameters of LN and NB distribution. Further, the impact of these estimates on the final compound distribution is analyzed.
|
guest ::
